Reverse Total Signed Vertex Domination in Graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonnegative signed total Roman domination in graphs

‎Let $G$ be a finite and simple graph with vertex set $V(G)$‎. ‎A nonnegative signed total Roman dominating function (NNSTRDF) on a‎ ‎graph $G$ is a function $f:V(G)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N(v)}f(x)ge 0$ for each‎ ‎$vin V(G)$‎, ‎where $N(v)$ is the open neighborhood of $v$‎, ‎and (ii) every vertex $u$ for which‎ ‎$f(u...

متن کامل

Signed total Italian k-domination in graphs

Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...

متن کامل

Signed total Roman k-domination in directed graphs

Let $D$ be a finite and simple digraph with vertex set $V(D)$‎.‎A signed total Roman $k$-dominating function (STR$k$DF) on‎‎$D$ is a function $f:V(D)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each‎‎$vin V(D)$‎, ‎where $N^{-}(v)$ consists of all vertices of $D$ from‎‎which arcs go into $v$‎, ‎and (ii) every vertex $u$ for which‎‎$f(u)=-1$ has a...

متن کامل

Weak signed Roman domination in graphs

A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...

متن کامل

Weak signed Roman k-domination in graphs

Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Journal of Discrete Mathematics

سال: 2013

ISSN: 2161-7635,2161-7643

DOI: 10.4236/ojdm.2013.31011